Solving sparse linear equations over finite fields
نویسنده
چکیده
Ahstruct-A “coordinate recurrence” method for solving sparse systems of linear equations over finite fields is described. The algorithms discussed all require O( n,( w + nl) logkn,) field operations, where nI is the maximum dimension of the coefficient matrix, w is approximately the number of field operations required to apply the matrix to a test vector, and the value of k depends on the algorithm. A probabilistic algorithm is shown to exist for finding the determinant of a square matrix. Also, probabilistic algorithms are shown to exist for finding the minimum polynomial and rank with some arbitrarily small possibility of error.
منابع مشابه
Solving sparse linear systems of equations over finite fields using bit-flipping algorithm
Article history: Received 22 February 2012 Accepted 20 May 2013 Available online 7 June 2013 Submitted by E. Zerz
متن کاملSolving Large Sparse Linear Systems over Finite Fields
Many of the fast methods for factoring integers and computing discrete logarithms require the solution of large sparse linear systems of equations over nite elds. This paper presents the results of implementations of several linear algebra algorithms. It shows that very large sparse systems can be solved eeciently by using combinations of structured Gaussian elimination and the conjugate gradie...
متن کاملPreconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation
Introduction Fractional differential equations (FDEs) have attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme may be a good approach, particularly, the schemes in numerical linear algebra for solving ...
متن کاملFinite iterative methods for solving systems of linear matrix equations over reflexive and anti-reflexive matrices
A matrix $Pintextmd{C}^{ntimes n}$ is called a generalized reflection matrix if $P^{H}=P$ and $P^{2}=I$. An $ntimes n$ complex matrix $A$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $P$ if $A=PAP$ ($A=-PAP$). In this paper, we introduce two iterative methods for solving the pair of matrix equations $AXB=C$ and $DXE=F$ over reflexiv...
متن کاملOn solving sparse algebraic equations over finite fields
A system of algebraic equations over the finite field Fq is called sparse if each equation depends on a small number of variables. In this paper new algorithms for solving such equations are presented. The mathematical expectation of their running time is derived. It compares favorably with the worst case estimations coming from the l-SAT problem analysis for q = 2 and the trivial estimation wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 32 شماره
صفحات -
تاریخ انتشار 1986